package cn.fay.chapter11;

import java.util.ArrayDeque;
import java.util.Collection;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.Stack;

public class QueueDemo {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Queue<Integer> queue=new LinkedList<Integer>();
		Random random=new Random(47);
		for (int i = 0; i < 10; i++) 
			queue.offer(random.nextInt(i+10));
		printQ(queue);
		Queue<Character> qc=new LinkedList<Character>();
		for (char c : "Brontosaurus".toCharArray()) 
			qc.offer(c);
		printQ(qc);
				
	}
	public static void printQ(Queue queue){
		while (queue.peek()!=null) 
			System.out.print(queue.remove()+" ");
		System.out.println();
		
	}

}
